Contribution of state modelling in efficient MAP symbol-by-symbol demodulation schemes for CPM-MIMO systems
نویسندگان
چکیده
منابع مشابه
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified. It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the...
متن کاملMAP Symbol Detection of CPM BurstsPeter
A receiver is developed for MAP symbol detection of a burst (i.e., nite-length) CPM signal received in additive white Gaussian noise. This minimum probability of symbol error receiver requires the entire burst of data and involves the use of both forward and backward recursions. Performance results are provided comparing the MAP symbol detector to the more commonly used ML sequence detector (i....
متن کاملComputationally Efficient Symbol Detection Schemes in Multi-Device STBC-MIMO Systems
The multi input multi output (MIMO) communication system has significantly higher channel capacity than the Single-Input-Single-Output (SISO) system for the same total transmission power and bandwidth (Foschini et al., 1998 & Telatar, 1999). It is known that the use of Space Time Block Code (STBC) can realize the increased capacity of MIMO systems and thus improve data throughput and spectral e...
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2014
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2013.10.006